A bound for the shortest reset words for semisimple synchronizing automata via the packing number
نویسنده
چکیده
We show that if a semisimple synchronizing automaton with $n$ states has a minimal reachable non-unary subset of cardinality $r\ge 2$, then there is a reset word of length at most $(n-1)D(2,r,n)$, where $D(2,r,n)$ is the $2$-packing number for families of $r$-subsets of $[1,n]$.
منابع مشابه
Synchronizing Automata with Extremal Properties
We present a few classes of synchronizing automata exhibiting certain extremal properties with regard to synchronization. The first is a series of automata with subsets whose shortest extending words are of length Θ(n 2), where n is the number of states of the automaton. This disproves a conjecture that every subset in a strongly connected synchronizing automaton is cn-extendable, for some cons...
متن کاملAn Extremal Series of Eulerian Synchronizing Automata
We present an infinite series of n-state Eulerian automata whose reset words have length at least (n − 3)/2. This improves the current lower bound on the length of shortest reset words in Eulerian automata. We conjecture that (n − 3)/2 also forms an upper bound for this class and we experimentally verify it for small automata by an exhaustive computation.
متن کاملThe \v{C}ern\'{y} conjecture for small automata: experimental report
We present a report from a series of experiments involving computation of the shortest reset words for automata with small number of states. We confirm that the Černý conjecture is true for all automata with at most 11 states on 2 letters. Also some new interesting results were obtained, including the third gap in the distribution of the shortest reset words and new slowly synchronizing classes...
متن کاملImproving the Upper Bound on the Length of the Shortest Reset Word
We improve the best upper bound on the length of the shortest reset words of synchronizing automata. The new bound is (15617n + 7500n + 9375n− 31250)/93750. So far, the best general upper bound was (n − n)/6 − 1 obtained by Pin and Frankl in 1983. Despite a number of efforts, the bound remained unchanged for about 34 years. The new upper bound improves the coefficient 1/6 at n by 4/46875. A wor...
متن کاملComputing the shortest reset words of synchronizing automata
In this paper we give the details of our new algorithm for finding minimal reset words of finite synchronizing automata. The problem is known to be computationally hard, so our algorithm is exponential in the worst case, but it is faster than the algorithms used so far and it performs well on average. The main idea is to use a bidirectional BFS and radix (Patricia) tries to store and compare su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1711.00651 شماره
صفحات -
تاریخ انتشار 2017